Active learning for directed exploration of complex systems.
Physics-based simulation codes are widely used in science and engineering to model complex systems that would be infeasible to study otherwise. Such codes provide the highest-fidelity representation of system behavior, but are often so slow to run that insight into the system is limited. For example, conducting an exhaustive sweep over a d-dimensional input parameter space with k-steps along each dimension requires kd simulation trials (translating into kd CPU-days for one of our current simulations). An alternative is directed exploration in which the next simulation trials are cleverly chosen at each step. Given the results of previous trials, supervised learning techniques (SVM, KDE, GP) are applied to build up simplified predictive models of system behavior. These models are then used within an active learning framework to identify the most valuable trials to run next. Several active learning strategies are examined including a recently-proposed information-theoretic approach. Performance is evaluated on a set of thirteen synthetic oracles, which serve as surrogates for the more expensive simulations and enable the experiments to be replicated by other researchers. 1.
Active Learning with Irrelevant Examples.
Abstract. Active learning algorithms attempt to accelerate the learning process by requesting labels for the most informative items first. In real-world problems, however, there may exist unlabeled items that are irrelevant to the user’s classification goals. Queries about these points slow down learning because they provide no information about the problem of interest. We have observed that when irrelevant items are present, active learning can perform worse than random selection, requiring more time (queries) to achieve the same level of accuracy. Therefore, we propose a novel approach, Relevance Bias, in which the active learner combines its default selection heuristic with the output of a simultaneously trained relevance classifier to favor items that are likely to be both informative and relevant. In our experiments on a real-world problem and two benchmark datasets, the Relevance Bias approach significantly improved the learning rate of three different active learning approaches. 1
Learning to Detect Small Impact Craters.

Automated Knowledge Discovery from Simulators.
In this paper, we explore one aspect of knowledge discovery from simulators, the landscape characterization problem, where the aim is to identify regions in the input/parameter/model space that lead to a particular output behavior. Large-scale numerical simulators are in widespread use by scientists and engineers across a range of government agencies, academia, and industry; in many cases, simulators provide the only means to examine processes that are infeasible or impossible to study otherwise. However, the cost of simulation studies can be quite high, both in terms of the time and computational resources required to conduct the trials and the manpower needed to sift through the resulting output. Thus, there is strong motivation to develop automated methods that enable more efficient knowledge extraction. Unlike traditional data mining, knowledge discovery from simulators is not limited to a static, pre-determined dataset; instead, the simulator itself can be used as an oracle to generate new data of our own choosing. We exploit this opportunity by employing active learning and support vector machines (SVMs) to choose which are the most valuable simulation trials to run next. On two realworld scientific simulators, one for asteroid collisions and one for magnetospheric modeling, we demonstrate twofold and sixfold reductions, respectively, in the number of simulator trials required to achieve a particular level of fidelity in landscape characterization as compared with a standard grid-based sampling approach.
Learning to Detect Small Impact Craters.

Mining Patters of Activity from Video Data.

The Techsat%2D21 autonomous space science agent.
ase.jpl.nasa.gov
The Diamond Eye Image Mining System.

Distortion%2DInvariant Recognition via Jittered Querie.
This paper presents a new approach for achieving distortion-invariant recognition and classification. A test example to be classified is viewed as a query intended to find similar examples in the training set (or class models derived from the training set). The key idea is that instead of querying with a single pattern, we construct a more robust query, based on the family of patterns formed by distorting the test example. Although query execution is slower than if the invariances were successfully pre-compiled during training, there are significant advantages in several contexts: (i) providing invariances in memory-based learning, (ii) in model selection, where reducing training time at the expense of test time is a desirable trade-off, and (iii) in enabling robust, ad hoc searches based on a single example. Preliminary tests for memory-based learning on the NIST handwritten digit database with a limited set of shearing and translation distortions produced an error rate of 1.35%. 1
The Diamond Eye Image Mining System.

Using Hierarchical Shape Models to Spot Keywords in Cursive Handwriting Data.
Different instances of a handwritten word consist of the same basic features (humps, cusps, crossings, etc.) arranged in a deformable spatial pattern. Thus, keywords in cursive text can be detected by looking for the appropriate features in the &#034;correct&#034; spatial configuration. A keyword can be modeled hierarchically as a set of word fragments, each of which consists of lowerlevel features. To allow flexibility, the spatial configuration of keypoints within a fragment is modeled using a Dryden-Mardia (DM) probability density over the shape of the configuration. In a writer-dependent test on a transcription of the Declaration of Independence  (¸1300 words, ¸7500 characters), the method detected all eleven instances of the keyword &#034;government &#034; with only four false positives.  1 Introduction  Handwriting offers a more natural human-computer interface than the traditional keyboard. A keyboard is frustrating for children and other novice users who possess limited typing skills. Even advance...
Probablistic Affine Invariants for Recognition.

A Probabilistic Approach to Object Recognition Using Local Photometry and Global Geometry.
. Many object classes, including human faces, can be modeled as a set of characteristic parts arranged in a variable spatial configuration. We introduce a simplified model of a deformable object class and derive the optimal detector for this model. However, the optimal detector is not realizable except under special circumstances (independent part positions). A cousin of the optimal detector is developed which uses &#034;soft&#034; part detectors with a probabilistic description of the spatial arrangement of the parts. Spatial arrangements are modeled probabilistically using shape statistics to achieve invariance to translation, rotation, and scaling. Improved recognition performance over methods based on &#034;hard&#034; part detectors is demonstrated for the problem of face detection in cluttered scenes. 1 Introduction  Visual recognition of objects (chairs, sneakers, faces, cups, cars) is one of the most challenging problems in computer vision and artificial intelligence. Historically, there has been a...
Learning to Recognize Volcanoes on Venus.
.  Dramatic improvements in sensor and image acquisition technology have created a demand for automated tools that can aid in the analysis of large image databases. We describe the development of JARtool, a trainable software system that learns to recognize volcanoes in a large data set of Venusian imagery. A machine learning approach is used because it is much easier for geologists to identify examples of volcanoes in the imagery than it is to specify domain knowledge as a set of pixellevel constraints. This approach can also provide portability to other domains without the need for explicit reprogramming; the user simply supplies the system with a new set of training examples. We show how the development of such a system requires a completely different set of skills than are required for applying machine learning to &#034;toy world&#034; domains. This paper discusses important aspects of the application process not commonly encountered in the &#034;toy world,&#034; including obtaining labeled training d...
Recognition of Planar Object Classes.
We present a new framework for recognizing planar object classes, which is based on local feature detectors and a probabilistic model of the spatial arrangement of the features. The allowed object deformations are represented through shape statistics, which are learned from examples. Instances of an object in an image are detected by finding the appropriate features in the correct spatial configuration. The algorithm is robust with respect to partial occlusion, detector false alarms, and missed features. A 94% success rate was achieved for the problem of locating quasi-frontal views of faces in cluttered scenes. 1 Introduction  Many early pattern recognition algorithms were based on template matching [13], which is optimal for detecting a known signal in white noise. However, since the underlying assumption that &#034;the signal is known exactly&#034; rarely holds true, considerable effort has been devoted to extending this method to handle variability in the target signal. For example, approach...


Finding Faces in Cluttered Scenes Using Labeled Random Graph Matching.

On the Efficient Allocation of Resources for Hypothesis Evaluation A Statistical Approach.

Automated Analysis of Radar Imagery of Venus Handling Lack of Ground Truth.

Knowledge Discovery in Large Image Databases Dealing with Uncertainties in Ground Truth.
This paper discusses the problem of knowledge discovery in image databases with particular focus  on the issues which arise when absolute ground truth is not available. It is often the case that a user exploring a large database is in search of items that are not easy to define completely. One way to  circumvent this problem is to ask the user to specify examples of the item of interest. However,  of specific items may in itself be inconsistent, whether it is multiple labels from a single at different times or labels from different The paper discusses issues which arise in terms of  elicitation of subjective probabilistic opinion, estimation of basic parameters of interest given  probabilistic labels, learning from probabilistic labels, and effective evaluation of both user and algorithm  performance in the absence of ground truth. The problem of searching the image data set in  order to automatically locate and catalog small volcanoes on the planet Venus is used as a case study. In th...
Inferring Ground Truth from Subjective Labelling of Venus Images.

